package com.vint.leetcode;


/*
 * 1.hard
 * 2.string
 * ALP组成的字符串，不能超过两个A或连续三个或以上L,其它情况为true
 * 给定长度为n, 求可能的情况数
 * n=2, 则PP,PA,PL,AL,AP,AA,LA,LP,LL, AA wrong, so output is 8
 * mod 10^9+7, n<100000
 */
public class Leetcode552 {

    public int checkRecord(int n) {

        return 0;
    }

    public static void main(String[] args) {
        Leetcode552 leetcode551 = new Leetcode552();
        System.out.println(leetcode551.checkRecord(3));
        System.out.println(leetcode551.checkRecord(4));
    }
  }
